We propose a dynamic energy balanced max flow routing algorithm to maximize load flow within the network lifetime\nand balance energy consumption to prolong the network lifetime in an energy-harvesting wireless sensor network. The\nproposed routing algorithm updates the transmission capacity between two nodes based on the residual energy of the\nnodes, which changes over time. Hence, the harvested energy is included in calculation of the maximum flow. Because\nthe flow distribution of the Fordââ?¬â??Fulkerson algorithm is not balanced, the energy consumption among the nodes is not\nbalanced, which limits the lifetime of the network. The proposed routing algorithm selects the node with the maximum\nresidual energy as the next hop and updates the edge capacity when the flow of any edge is not sufficient for the next\ndelivery, to balance energy consumption among nodes and prolong the lifetime of the network. Simulation results\nrevealed that the proposed routing algorithm has advantages over the Fordââ?¬â??Fulkerson algorithm and the dynamic max\nflow algorithm with respect to extending the load flow and the lifetime of the network in a regular network, a smallworld\nnetwork, and a scale-free network.
Loading....